package cn.wolfcode.wolf2w.query;

import lombok.Getter;

import java.util.HashMap;
import java.util.Map;

@Getter
public class TravelCondition {
    private int min;
    private int max;

    //出行天数
    public static final Map<Integer,TravelCondition> DAY_MAP = new HashMap<>();
    //人均消费
    public static final Map<Integer,TravelCondition> MAP_PEREXPEND = new HashMap<>();

    static {
        DAY_MAP.put(1,new TravelCondition(0, 3));
        DAY_MAP.put(2,new TravelCondition(4, 7));
        DAY_MAP.put(3,new TravelCondition(8, 14));
        DAY_MAP.put(4,new TravelCondition(15, Integer.MAX_VALUE));

        MAP_PEREXPEND.put(1,new TravelCondition(1,999));
        MAP_PEREXPEND.put(2,new TravelCondition(1000,6000));
        MAP_PEREXPEND.put(3,new TravelCondition(6001,20000));
        MAP_PEREXPEND.put(4,new TravelCondition(20001,Integer.MAX_VALUE));
    }
    public TravelCondition(int min,int max){
        this.min = min;
        this.max= max;
    }
}
